Deterministic Online Optical Call Admission Revisited

In the problem of Online Call Admission in Optical Networks, briefly called oca, we are given a graph G = (V,E) together with a set of wavelengths W (χ := |W |) and a finite sequence σ = r1, r2, . . . of calls which arrive in an online fashion. Each call rj specifies a pair of nodes to be connected. A lightpath is a path in G together with a wavelength λ ∈ W . Upon arrival of a call, an online algorithm must decide immediately and irrevocably whether to accept or to reject the call without any knowledge of calls which appear later in the sequence. If the call is accepted, the algorithm must provide a lightpath to connect the specified nodes. The essential restriction is the wavelength conflict constraint: each wavelength is available only once per edge, which implies that two lightpaths sharing an edge must have different wavelengths. The objective in oca is to maximize the overall profit, that is, the number of accepted calls. A result by Awerbuch et al. states that a c-competitive algorithm for oca with one wavelength, i.e., χ := |W | = 1, implies a (c + 1)-competitive algorithm for general numbers of wavelengths. However, for instance, for the line with n + 1 nodes, a lower bound of n for the competitive ratio of deterministic algorithms for χ = 1 makes this result void in many cases. We provide the first deterministic competitive algorithms for χ > 1 wavelengths which achieve a sublinear competitive ratio on the line.